Design and evaluation of a scalable hierarchical application component placement algorithm for cloud resource allocation

In the context of cloud systems, mapping application components to a set of physical servers and assigning resources to those components is challenging. For large-scale clouds, traditional resource allocation systems, which rely on a centralized management paradigm, become ineffective and inefficient. Therefore, there is an essential need of providing new management solutions that scale well with the size of large cloud systems. In this paper a distributed and hierarchical component placement algorithm is presented, evaluated and compared to a centralized algorithm. Each application is represented as a collection of interacting services, and multiple service types with differing placement characteristics are considered. Our evaluations show that the proposed algorithm is at least 84.65 times faster and offers better scalability compared with a central approach, while the percentage of servers used and fully placed applications remains close to that of the centralized algorithm

Algorithms for advance bandwidth reservation in media production networks

Media production generally requires many geographically distributed actors (e.g., production houses, broadcasters, advertisers) to exchange huge amounts of raw video and audio data. Traditional distribution techniques, such as dedicated point-to-point optical links, are highly inefficient in terms of installation time and cost. To improve efficiency, shared media production networks that connect all involved actors over a large geographical area, are currently being deployed. The traffic in such networks is often predictable, as the timing and bandwidth requirements of data transfers are generally known hours or even days in advance. As such, the use of advance bandwidth reservation (AR) can greatly increase resource utilization and cost efficiency. In this paper, we propose an Integer Linear Programming formulation of the bandwidth scheduling problem, which takes into account the specific characteristics of media production networks, is presented. Two novel optimization algorithms based on this model are thoroughly evaluated and compared by means of in-depth simulation results

Single-path versus multi-path advance reservation in media production networks

In media production, a set of actors works simultaneously on video content from different sources. If the actors are geographically spread, the use of a shared substrate network can improve their collaborative efficiency. In such a network traffic consists mostly of large video files, which need to be transferred respecting strict deadlines. Restrictions on the underlying network can force the use of single-path routing mechanisms over multi-path approaches. In this paper, we investigate the influence of using single-path routing compared to multi-path routing in deadline-aware advance reservation (AR) systems for media production networks. We have modified our previously designed optimal multi-path advance reservation model to incorporate the single-path mechanism and heuristic alternatives are presented and thoroughly evaluated. The experimental results show that the single-path optimal model can only provide satisfactory performance when the network is not in contention. With the heuristic approach, when adequate bandwidth is provided, the multi-path approach outperforms the single-path by up to 7.3%

Algorithms for efficient data management of component-based applications in cloud environments

Cloud environments face a growing demand for application hosting, and applications consisting of multiple data-sources and storage components. The need to ensure service level agreements for these types of applications creates important challenges for cloud infrastructure providers. The main contribution of this paper is an optimal cost-effective model and two algorithms to map component-based data oriented applications to cloud platforms. The first algorithm is based on an Integer Linear Programming formulation and minimizes an objective function, taking into account the capacities of the available nodes and links, as well as the customer requirements. This algorithm is able to obtain the optimal solution, but shows a limited scalability. For this reason a heuristic algorithm is designed to solve the scalability issue. The experimental results thoroughly compare the execution times and obtained node usage for both algorithms

[Escolanías] [Material gráfico]

Contiene fotografías pertenecientes al archivo fotográfico del diario "Región", publicadas entre 1976 y 1981Algunas fotos no indican autoría. El resto firmadas por Astra (Oviedo), y Foto Cine Alfonso Pascual (Noreña